A New Efficient Hybrid Exact String Matching Algorithm and Its Applications

String matching is one of most challenging issues in computer science. In this study, a new efficient hybrid string matching algorithm called Atheer was developed. This proposed algorithm is integrated with the excellent properties of three algorithms, namely, the Karp–Rabin, Raita, and Smith algorithms. The Atheer algorithm demonstrated an efficient performance in the number of comparison attempts as well as in the character comparisons with original algorithms in the first step and with recent and standard algorithms (i.e., Horspool, Quick search, Two-way, Fast search, SSABS, TVSBS, AKRAM, and Maximum shift) in the second step. The proposed algorithm in this study utilized several data types, namely, DNA sequences, Protein sequences, XML structures, Pitch characters, English texts, and Source codes. The Pitch database was the best match for Atheer in terms of the number of comparison attempts involving long and short patterns; the DNA database was the worst match. In terms of the character comparisons, the best database was the Source code database; the DNA sequence data type was also the worst match when short and long patterns were used. [AbdulRazzaq AA, Rashid NA, Abu-Hashem MA, Hasan AA. A New Efficient Hybrid Exact String Matching Algorithm and Its Applications. Life Sci J 2014;11(10):474-488] (ISSN:1097-8135). http://www.lifesciencesite.com. 65